The time to read the input and initialise the problem = 313 ms
The time to create the LP bound problem = 15 ms
The time to compute the linear programming bound = 94 ms
The linear programming lower bound on the solution is:
x11=0.000000
x12=1.000000
x13=0.000000
x14=0.000000
x15=0.000000
x21=0.000000
x22=0.788462
x23=0.211538
x24=0.000000
x25=0.000000
x31=0.000000
x32=1.000000
x33=0.000000
x34=0.000000
x35=0.000000
x41=0.000000
x42=0.788462
x43=0.211538
x44=0.000000
x45=0.000000
x51=0.000000
x52=1.000000
x53=0.000000
x54=0.000000
x55=0.000000
x61=0.000000
x62=0.788462
x63=0.211538
x64=0.000000
x65=0.000000
x71=0.000000
x72=0.788462
x73=0.211538
x74=0.000000
x75=0.000000
x81=0.000000
x82=0.788462
x83=0.211538
x84=0.000000
x85=0.000000
x91=0.000000
x92=0.788462
x93=0.211538
x94=0.000000
x95=0.000000
x101=0.000000
x102=1.000000
x103=0.000000
x104=0.000000
x105=0.000000
y1=0.000000
y2=1.000000
y3=0.211538
y4=0.000000
y5=0.000000
z1=0.075601
z2=0.000000
z3=0.360360
w11=0.000000
w12=0.000000
w13=22.000000
w14=0.000000
w15=0.000000
w21=0.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=160.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=16622.178805
The time to read the LP bound solution = 0 ms
Run time is 1422 ms
